/**
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package ro.uvt.sp.lp.hw1.beermugs.algorithms;

import java.util.List;

/**
 * 
 * @author LP
 * Clasa abstracta ce trebuie implementate de fiecare clasa copil.
 * nu poate fi instantiata 
 */
public abstract class Solver {
	/**
	 * verifica daca starea curenta determina solutie
	 * @param s
	 * @return
	 */
	public abstract boolean isGoal(State s);
	
	/**
	 * rulare fara limita a cautarii
	 */
	public abstract void run();
	
	/**
	 * rulare cu limita a cautarii 
	 * @param depth
	 */
	public abstract void run(int depth);
	
	/**
	 * calculeaza posibilii copii ai starii nodului curent
	 * @param s
	 * @return
	 */
	public abstract List<State> expand(State s);
	
	public abstract void prettyPrinting(State state);
	
}
